‎we consider two commutativity ratios $pr(g)$ and $f(g)$ in a finite group $g$‎ ‎and examine the properties of $g$ when these ratios are `large'‎. ‎we show that‎ ‎if $pr(g) > frac{7}{24}$‎, ‎then $g$ is metabelian and we give threshold‎ ‎results in the cases where $g$ is insoluble and $g'$ is nilpotent‎. ‎we also‎ ‎show that if $f(g) > frac{1}{2}$‎, ‎then $f(g) = frac{n+1}{2n}$‎, ‎for some‎ ‎na...

In this paper, we study the tensor commutativity degree of pair of finite groups. Erdos introduced the relative commutativity degree and studied its properties. Then, Mr. Niroomand introduced the tensor relative commutativity degree, calculated tensor relative degree for some groups, and studied its properties. Also, he explained its relation with relative commutativity degree. In this paper, w...

For a nite group G the commutativity degree denote by d(G) and dend:$$d(G) =frac{|{(x; y)|x, yin G,xy = yx}|}{|G|^2}.$$ In [2] authors found commutativity degree for some groups,in this paper we nd commutativity degree for a class of groups that have high nilpontencies.

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

‎‎for a finite group $g$ and a subgroup $h$ of $g$‎, ‎the relative commutativity degree of $h$ in $g$‎, ‎denoted by $d(h,g)$‎, ‎is the probability that an element of $h$ commutes with an element of $g$‎. ‎let $mathcal{d}(g)={d(h,g):hleq g}$ be the set of all relative commutativity degrees of subgroups of $g$‎. ‎it is shown that a finite group $g$ admits three relative commutativity degrees if a...

Traditional analysis and usage of operation commutativity relies on pairwise commutativity relationships. In contrast, this paper presentsmethod group commutativity, which specifies the conditions under which operations in amethod group will commute. Method group commutativity can be practically applied to efficiently support distributed object caching and concurrency control. A formal definiti...

Although the explicit commutativitiy conditions for second-order linear time-varying systems have been appeared in some literature, these are all for initially relaxed systems. This paper presents explicit necessary and sufficient commutativity conditions for commutativity of second-order linear time-varying systems with non-zero initial conditions. It has appeared interesting that the second r...

Let P2(G) be defined as the probability that any two elements selected at random from the group G, commute with one another. If G is an Abelian group, P2(G) = 1, so our interest lies in the properties of the commutativity of nonAbelian groups. Particular results include that the maximum commutativity of a non-Abelian group is 5/8, and this degree of commutativity only occurs when the order of t...

Commutativity has the same inherent limitations as compatibility. Then, it is worth conceiving simple concurrency control techniques. We propose a restricted form of commutativity which increases parallelism without incurring a higher overhead than compatibility. Advantages of our proposition are: (1) commutativity of operations is determined at compile-time, (2) runtime checking is as efficien...